Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
p(0) |
→ 0 |
| 2: |
|
p(s(x)) |
→ x |
| 3: |
|
le(0,y) |
→ true |
| 4: |
|
le(s(x),0) |
→ false |
| 5: |
|
le(s(x),s(y)) |
→ le(x,y) |
| 6: |
|
minus(x,y) |
→ if(le(x,y),x,y) |
| 7: |
|
if(true,x,y) |
→ 0 |
| 8: |
|
if(false,x,y) |
→ s(minus(p(x),y)) |
|
There are 5 dependency pairs:
|
| 9: |
|
LE(s(x),s(y)) |
→ LE(x,y) |
| 10: |
|
MINUS(x,y) |
→ IF(le(x,y),x,y) |
| 11: |
|
MINUS(x,y) |
→ LE(x,y) |
| 12: |
|
IF(false,x,y) |
→ MINUS(p(x),y) |
| 13: |
|
IF(false,x,y) |
→ P(x) |
|
The approximated dependency graph contains 2 SCCs:
{9}
and {10,12}.
-
Consider the SCC {9}.
There are no usable rules.
By taking the AF π with
π(LE) = 1 together with
the lexicographic path order with
empty precedence,
rule 9
is strictly decreasing.
-
Consider the SCC {10,12}.
The usable rules are {1-5}.
The constraints could not be solved.
Tyrolean Termination Tool (0.05 seconds)
--- May 4, 2006